منابع مشابه
Application-Tailored XML Storage
Several native approaches to storing large XML data sets exist. In all of these approaches the internal data representation is designed to support any ad-hoc XQuery query. In this paper we argue that XQuery and its data model are too universal and any one-size-fits-all XML representation leads to significant overheads in terms of representation size and complexity. Based on the consideration th...
متن کاملSmart Nanocatalysts with Streamline Shapes
Particulate catalysts with streamline shapes have important impacts on fluid-related reactions, and they need to be properly characterized. However, utilization of streamline-shaped catalysts for heterogeneous catalysis has remained an unexplored area due to the lack of easy-to-use techniques to produce such shaped catalysts, especially at the small length scale of the submicron to micron regim...
متن کاملTailored Randomized block MCMC Methods with Application to DSGE Models
In this paper we develop new Markov chain Monte Carlo schemes for the estimation of Bayesian models. One key feature of our method, which we call the tailored randomized block Metropolis-Hastings (TaRB-MH) method, is the random clustering of the parameters at every iteration into an arbitrary number of blocks. Then each block is sequentially updated through an M-H step. Another feature is that ...
متن کاملIndustrial application of impurity flocculation to streamline antibody purification processes
2015 Flocculation technologies offer significant benefits to industrial mammalian cell culture processes, including increased clarification efficiency, impurity removal and process simplification. In this paper, the application and performance of flocculation technologies employed in the harvest process of monoclonal antibody Chinese hamster ovary cell culture are reviewed. Attention has been p...
متن کاملEvolutionary Design of Application Tailored Neural Networks
| First, an evolutionary algorithm for designing a single hidden layer feedfor-ward neural networks is proposed. The algorithm constructs a problem tailored neu-ral network by incremental introduction of new hidden units. Each new hidden unit is added to the network by linear partitioning of the hidden-layer representation through a genetic search. Second, a two stage algorithm speed-up is achi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computer Systems
سال: 2011
ISSN: 0734-2071,1557-7333
DOI: 10.1145/1963559.1963562